Motion planning for multi-robot assembly systems
نویسندگان
چکیده
منابع مشابه
Motion planning for multi-robot assembly systems
This paper addresses a multi-robot optimal assembly planning problem which in essence is an augmented Travelling Salesperson Problem (TSP+). In our TSP+, both the “salesperson” (a robot with a tool) as well as the “cities” (another robot with a workpiece) move. Namely, in addition to the sequencing of tasks, further planning is required to choose where the “salesperson” should rendezvous with e...
متن کاملMulti-Robot Motion Planning
We present a simple and natural extension of the multi-robot motion planning problem where the robots are partitioned into groups (colors), such that in each group the robots are interchangeable. Every robot is no longer required to move to a specific target, but rather to some target placement that is assigned to its group. We call this problem k-color multi-robot motion planning and provide a...
متن کاملDynamic Networks for Motion Planning in Multi-Robot Space Systems
A new motion planning framework is presented that enables multiple mobile robots with limited ranges of sensing and communication to maneuver and achieve goals safely in dynamic environments. The framework is applicable to both planetary rover and free-floating space robot applications. To combine the respective advantages of centralized and decentralized planning, this framework is based on th...
متن کاملEffective Metrics for Multi-Robot Motion-Planning
We study the effectiveness of metrics for MultiRobot Motion-Planning (MRMP) when using RRT-style sampling-based planners. These metrics play the crucial role of determining the nearest neighbors of configurations and in that they regulate the connectivity of the underlying roadmaps produced by the planners and other properties like the quality of solution paths. After screening over a dozen dif...
متن کاملDistributed gradient for multi-robot motion planning
Distributed stochastic search is proposed for cooperative behavior in multi-robot systems. Distributed gradient is examined. This method consists of multiple stochastic search algorithms that start from different points in the solutions space and interact to each other while moving towards the goal position. Distributed gradient is shown to be efficient when the motion of the robots towards the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computer Integrated Manufacturing
سال: 2000
ISSN: 0951-192X,1362-3052
DOI: 10.1080/095119200407660